翻訳と辞書 Words near each other ・ Factory-kitchen ・ Factory-to-consumer ・ Factorydale, Nova Scotia ・ FactoryPMI ・ FactorySQL ・ Factoryville, Nebraska ・ Factoryville, Pennsylvania ・ Factoría de Ficción ・ Factoría de Ficción (pay television) ・ Factor analysis of information risk ・ Factor analysis of mixed data ・ Factor base ・ Factor cost ・ Factor D ・ Factor endowment ・ Factor graph ・ Factor H ・ Factor I ・ Factor I Deficiency ・ Factor I deficiency ・ Factor income ・ Factor IX ・ Factor market ・ Factor of automorphy ・ Factor of safety ・ Factor oracle ・ Factor payments ・ Factor price ・ Factor price equalization ・ Factor Prize for Southern Art Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Factor graph ： ウィキペディア英語版 Factor graph A factor graph is a bipartite graph representing the factorization of a function. In probability theory and its applications, factor graphs are used to represent factorization of a probability distribution function, enabling efficient computations, such as the computation of marginal distributions through the sum-product algorithm. One of the important success stories of factor graphs and the sum-product algorithm is the decoding of capacity-approaching error-correcting codes, such as LDPC and turbo codes. Factor graphs generalize constraint graphs. A factor whose value is either 0 or 1 is called a constraint. A constraint graph is a factor graph where all factors are constraints. The max-product algorithm for factor graphs can be viewed as a generalization of the arc-consistency algorithm for constraint processing. ==Definition== A factor graph is a bipartite graph representing the factorization of a function. Given a factorization of a function $g(X\_1,X\_2,\backslash dots,X\_n)$, :$g(X\_1,X\_2,\backslash dots,X\_n)\; =\; \backslash prod\_^m\; f\_j(S\_j),$ where $S\_j\; \backslash subseteq\; \backslash$, the corresponding factor graph $G=(X,F,E)$ consists of variable vertices $X=\backslash$, factor vertices $F=\backslash$, and edges $E$. The edges depend on the factorization as follows: there is an undirected edge between factor vertex $f\_j$ and variable vertex $X\_k$ iff $X\_k\; \backslash in\; S\_j$. The function is tacitly assumed to be real-valued: $g(X\_1,X\_2,\backslash dots,X\_n)\; \backslash in\; \backslash Bbb$. Factor graphs can be combined with message passing algorithms to efficiently compute certain characteristics of the function $g(X\_1,X\_2,\backslash dots,X\_n)$, such as the marginal distributions. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Factor graph」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.